Resource allocation for configurable bandwidths

ABSTRACT

Disclosed are methods, apparatus and systems for resource allocation when configurable bandwidths are available. One method includes performing a first transmission using a first set of resources in a first bandwidth, and subsequently performing a second transmission using a second set of resources in a second bandwidth, where the first bandwidth is greater than the second bandwidth, where the first and second set of resources are identified by a first and second value, respectively, and where a bit representation of the first value is a zero-padded version of a bit representation of the second value on either the most significant bit (MSB) or the least significant bit (LSB).

CROSS REFERENCE TO RELATED APPLICATIONS

This patent document is a divisional of U.S. patent application Ser. No.16/947,629, filed Aug. 10, 2020, which is a continuation of and claimsbenefit of priority to International Patent Application No.PCT/CN2018/076856, filed on Feb. 14, 2018. The entire content of thebefore-mentioned patent application is incorporated by reference as partof the disclosure of this application.

TECHNICAL FIELD

This document is directed generally to wireless communications.

BACKGROUND

Wireless communication technologies are moving the world toward anincreasingly connected and networked society. The rapid growth ofwireless communications and advances in technology has led to greaterdemand for capacity and connectivity. Other aspects, such as energyconsumption, device cost, spectral efficiency, and latency are alsoimportant to meeting the needs of various communication scenarios. Incomparison with the existing wireless networks, next generation systemsand wireless communication techniques need to provide greaterflexibility in resource allocation and support a huge number ofconnections.

SUMMARY

This document relates to methods, systems, and devices for resourceallocation in New Radio (NR) systems, for example, that provideconfigurable bandwidths.

In one exemplary aspect, a wireless communication method is disclosed.The method includes performing a first transmission using a first set ofresources in a first bandwidth, and performing, subsequent to the firsttransmission, a second transmission using a second set of resources in asecond bandwidth, where a first value that identifies the first set ofresources is used, based on an embodiment of the disclosed technology,to determine a second value that identifies the second set of resources.

In yet another exemplary aspect, the above-described methods areembodied in the form of processor-executable code and stored in acomputer-readable program medium.

In yet another exemplary embodiment, a device that is configured oroperable to perform the above-described methods is disclosed.

The above and other aspects and their implementations are described ingreater detail in the drawings, the descriptions, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example of a base station (BS) and user equipment (UE)in wireless communication, in accordance with some embodiments of thepresently disclosed technology.

FIG. 2 shows an example of method for resource allocation forconfigurable bandwidths.

FIGS. 3A-3B show an example of another method for resource allocationfor configurable bandwidths.

FIGS. 4A, 4B and 4C show examples of yet another method for resourceallocation for configurable bandwidths.

FIG. 5 shows a flowchart for an exemplary method for resource allocationfor configurable bandwidths.

FIG. 6 is a block diagram representation of a portion of an apparatusthat may implement a method or technique described in this patentdocument.

FIG. 7 shows an example of monotonicity and non-monotonicity in anexemplary method for resource allocation for configurable bandwidths.

DETAILED DESCRIPTION

The New Radio (NR) system, which is designed to use a much widerbandwidth than the existing Long Term Evolution (LTE) system, enablesmore efficient use of resources with lower control overhead.Furthermore, the introduction of the new bandwidth part (BWP) conceptallows to flexibly and dynamically configure User Equipment's (UE's)operating bandwidth, which will make NR an energy efficient solutiondespite the support of wide bandwidth.

The concept of BWP for NR provides a means of operating UEs with smallerBW than the configured channel bandwidth (CBW), which makes NR an energyefficient solution despite the support of wideband operation. Operationusing BWPs involves the UE is not being required to transmit or receiveoutside of the configured frequency range of the active BWP, whichresults in power savings.

In an example, switching from one BWP to another BWP may includespecifying PDSCH or PUSCH resource allocation. This may be accomplishedusing a resource indication value (MV). In general, two values (e.g.number or length of resource blocks and a starting resource block) maybe used to specify a resource allocation. The RIV enables representingboth these values using a single value, thereby simplifying the overheadrequired to communicate the resource allocation specification.

FIG. 1 shows an example of a wireless communication system that includesa base station (BS) 120 and one or more user equipment (UE) 111, 112 and113. In some embodiments, the UEs may perform a first transmission (131,132, 133) using a first set of resources. In a system with configurablebandwidths, the base station may then transmit an indication to use adifferent BWP (141, 142, 143) to the UEs. Subsequently, the UEs mayperform a second transmission using a second set of resources.

Examples of Resource Allocation (RA) in Existing Systems

In an existing NR system, a BWP index may be used to change the BWPbeing used by a UE. The downlink control information (DCI) is related tothe BWP indicated by the index, but the interpretation of the DCI(number of bits) is determined by the current BWP. Currently, anoperation that maps the DCI to a new BWP (different from the currentBWP) does not exist.

In some existing systems, sizes of all DCI bitfields in DCI formats 0-1and 1-1 in UE-specific search space (USS) are determined by the currentBWP. Data may be transmitted on the BWP indicated by the BWP index. Ifthe BWP index activates another BWP, the following transformation rulesare implemented: (1) zero-pad small bitfields to match the new BWP, and(2) truncate large bitfields to match the new BWP.

In existing NR resource allocation of type 1, the DCI frequency domainresource allocation field needs ┌log₂(N_(RB)(N_(RB)+1)/2)┐ bits, whereN_(RB) is the number of resource blocks (RBs, which may also be referredto as physical resource blocks or PRBs). In an example, if a smaller BWP(e.g. 50 RBs which needs 11 bits) needs to switch to a larger BWP (e.g.200 RBs which needs 15 bits), the current NR system algorithm zero-padsthe smaller bitfield to match the new BWP (4 zero bits are padded). TheNR system defines two schemes: (1) zero-pad on the most significant bit(MSB) of the smaller bitfield, or (2) zero-pad on the least significantbit (LSB) of the smaller bitfield.

According to the mathematical definition of the RIV, zero-padding on theMSB of the bitfield implies that the RIV may only take on very smallvalues, and therefore the length of the RBs may only take on very smallvalues. Similarly, zero-padding on the LSB of the bitfield implies thatthe RIV can only take on very large values, and thus the length of theRBs may take on only very large values.

In an example, and in the case that the BWP is switching to a largerBWP, zero-padding on the LSB of the bitfield may seem more reasonable.However, if the network node (e.g. gNB) has other UEs scheduled on theRBs that occupy the part of the frequency that corresponds to RBs withhigh-valued indices, then zero-padding on the LSB will result inscheduling conflicts, and thus, zero-padding on the MSB might bepreferable.

As discussed, the RIV may depend on number/length of resource blocks(denoted L_(RBS)) and a starting resource block (denoted RB_(start)).According to the mathematical definition of the RIV in NR, the RIVs aregenerated by keeping the value of L_(RBs) constant and increasing thevalue of RB_(start), which may result in a limit on the length of theRBs that may be scheduled by the UE, and which may cause resourceblocking.

Numerical Example. In an example for resource allocation (RA) type 1,BWP1 uses 24 RBs (which needs 9 bits), and BWP2 uses 275 RBs (whichneeds 16 bits). If a UE needs to switch from BWP1 to BWP2, it needs tozero-pad 7 bits.

Assume the BWP1 bitfield is configured as 001101101.

Zero-padding on the MSB of the bitfield for BWP2 results in0000000001101101, which is RIV=107. According to the mathematicaldefinition of RIV, this implies that L_(RBs) is 1 RB and RB_(start) isthe 107th RB. Alternatively, zero-padding on the LSB of the bitfield forBWP2 results in 0011011010000000, which is RIV=13952. According to themathematical definition of RIV, this implies that L_(RBs) is 51 RBs andRB_(start) is the 107th RB.

Mathematical Definition. The mathematical definition of the RIV,according to the existing NR specification, cannot guarantee themonotonicity of the RIV.

if (L _(RBs)−1)≤└N _(BWP) ^(size)/2┘ then

RIV=N _(BWP) ^(size)(L _(RBs)−1)+RB _(start)

else

RIV=N _(BWP) ^(size)(N _(BWP) ^(size) −L _(RBs)+1)+(N _(BWP)^(size)−1−RB _(start))

where L_(RBs)≥1 and shall not exceed N_(BWP) ^(size)−RB_(start).

In particular, the “else” condition cannot guarantee the monotonicity ofthe RIV.

In the NR (new RAT) resource allocation of type 1, similar to the LTEresource allocation of type 2, the resource block assignment informationto a UE indicates a set of contiguously allocated resource blocks withinthe active carrier bandwidth part of size N_(BWP) ^(size) PRBs. However,when DCI format 1-0 is decoded in the common search space in CORESET 0,the indication is interpreted as being for the initial bandwidth part ofsize N_(BWP) ^(size) PRBs to be used.

For NR resource allocation type 1, the └log₂ (N_(BWP) ^(size)(N_(BWP)^(size)+1)/2)┘ LSBs provide the resource allocation in DCI formatfrequency domain resource allocation field, and the resource allocationfield consists of a resource indication value (RIV) corresponding to astarting resource block (RB_(start)) and a length in terms ofcontiguously allocated resource blocks (L_(RBs)).

Typically, these two values (RB_(start) and L_(RBs)) may be used tospecify resource allocation, but using the RIV enables therepresentation of these two values using a single value, which wouldhave some advantage in terms of number of bits to carry the information.

The mathematical definition for the MV, depending on the DCI format, isgiven as:

if (L _(RBs)−1)≤└N _(BWP) ^(size)/2┘ then

RIV=N _(BWP) ^(size)(L _(RBs)−1)+RB _(start)

else

RIV=N _(BWP) ^(size)(N _(BWP) ^(size) −L _(RBs)+1)+(N _(BWP)^(size)−1−RB _(start))

where L_(RBs)≥1 and shall not exceed N_(BWP) ^(size)−RB_(start).

The above definition shows that sorting order of the RIV value includesinitially keeping L_(RBs) constant and increasing RB_(start). Forexample, and using the notation (RB_(start),L_(RBs)),

RIV=0 is equivalent to (0,1)

RIV=1 is equivalent to (1,1)

RIV=2 is equivalent to (2,1)

RIV=_(BWP) ^(size) is equivalent to (0,2)

BWP Background. A UE configured for operation in bandwidth parts (BWPs)of a serving cell, is configured by higher layers for the serving cellto use a set of at most four bandwidth parts (BWPs) for receptions bythe UE (DL BWP set) in a DL bandwidth by parameter DL-BWP and a set ofat most four BWPs for transmissions by the UE (UL BWP set) in an ULbandwidth by parameter UL-BWP for the serving cell.

If a bandwidth path indicator field is configured in DCI format 1-1, thebandwidth path indicator field value indicates the active DL BWP, fromthe configured DL BWP set, for DL receptions. If a bandwidth pathindicator field is configured in DCI format 0-1, the bandwidth pathindicator field value indicates the active UL BWP, from the configuredUL BWP set, for UL transmissions.

Example Embodiments for RA Based on RIV Zero-Padding with Bit Indication

As shown in FIG. 2, zero-padding on the MSB or the LSB may be used toconvert a bitfield associated with a first BWP to be used for a secondBWP. As shown therein, the BWP1 RA bitfield can be padded on the MSB orthe LSB to increase its length to be equivalent to that of the BWP2 RAbitfield. Embodiments of the disclosed technology may use an indicationbit to select between zero-padding on the MSB or the LSB.

In some embodiments, the indication bit is in the frequency domainresource allocation field, e.g. an MSB of the field or a secondsignificant bit of the field. In other embodiments, the indication bitmay be an implied indication through bandwidth path indicator field,when the BWP index is different from the current BWP index.

In some embodiments, where both resource allocation type 0 and type 1are configured, the indication bit may be used to select between aresource allocation type (e.g. dynamic switching between RA type 0 andRA type 1). In some embodiments, the network node (e.g. eNB) may selectwhether the zero-padding is on the MSB or on the LSB.

Example Embodiments for RA Based on New RIV Mathematical Definition

Embodiments of the disclosed technology may use a new mathematicaldefinition of RIV to ensure that resource blocking is eliminated. Asdescribed in the context of existing NR systems and as shown in FIG. 3B,RIV values may be determined by first keeping L_(RBs) constant andincreasing RB_(start).

In contrast, and as shown in FIG. 3A, some embodiments of the disclosedtechnology determine RIV values by increasing L_(RBs) from oneRB_(start). Then, the RB_(start) values are increased keeping L_(RBs)constant at a fixed value.

In an example, and using the notation (RB_(start),L_(RBs)), a pluralityof RIVs may be determined as follows:

RIV=0 is equivalent to (0,1)

RIV=1 is equivalent to (0,2)

RIV=2 is equivalent to (0,3)

RIV=N_(BWP) ^(size)−2 is equivalent to (0,N_(BWP) ^(size)−1)

RIV=_(BWP) ^(size)−1 is equivalent to (1,1)

RIV=max_value is equivalent to (N_(BWP) ^(size)−1,1)

In some embodiments, and applicable to the above scenario, the followingfirst alternate mathematical definition for the RIV may be defined as:

if RB _(start) ≤└N _(BWP) ^(size)/2┘ then

RIV=N _(BWP) ^(size) RB _(start)+(L _(RBs)−1)

else

RIV=N _(BWP) ^(size)(N _(BWP) ^(size) −RB _(start))+(N _(BWP) ^(size) −L_(RBs))

where L_(RBs)≥1 and shall not exceed N_(BWP) ^(size)−RB_(start).

In other embodiments, an arbitrary starting point for the resource blockindex, or a maximum value of the resource block index may be used. Inthis scenario, a plurality of RIVs may be determined as follows:

RIV=1 is equivalent to (N_(BWP) ^(size)−1,1)

RIV=2 is equivalent to (N_(BWP) ^(size)−2,1)

RIV=3 is equivalent to (N_(BWP) ^(size)−2,2)

RIV=4 is equivalent to (N_(BWP) ^(size)−3,1)

RIV=5 is equivalent to (N_(BWP) ^(size)−3,2)

RIV=6 is equivalent to (N_(BWP) ^(size)−3,3)

RIV=max_value is equivalent to (0,N_(BWP) ^(size))

wherein RIVtarget=abs(RIVmax−RIV).

In some embodiments, and applicable to the above scenario, the followingsecond alternate mathematical definition for the RIV may be defined as:

if RB _(start) ≤└N _(BWP) ^(size)/2┘ then

RIV _(temp) =N _(BWP) ^(size) RB _(start)+(L _(RBs)−1)

else

RIV _(temp) =N _(BWP) ^(size)(N _(BWP) ^(size) −RB _(start))+(N _(BWP)^(size) +L _(RBs))

RIV=RIV _(Max) −RIV _(temp)

where L_(RBs)≥1 and shall not exceed N_(BWP) ^(size)−RB_(start).

In some embodiments, the first or second alternate mathematicaldefinitions for the RIV may be selected based on an indication bit. Inan example, the indication bit is in the frequency domain resourceallocation field, e.g. an MSB of the field or a second significant bitof the field. In another example, the indication bit may be an impliedindication through bandwidth path indicator field, when the BWP index isdifferent from the current BWP index.

As is seen and described in this patent documents, the variousembodiments of the disclosed technology may be combined unless theimplementations expressly prohibit it. For example, the zero-paddingapproach may be used in conjunction with the new mathematicaldefinitions for the RIV as seen in the following numerical example.

Numerical Example. Continuing the example described in the context of anexisting NR system for resource allocation (RA) type 1, in which BWP1uses 24 RBs and BWP2 uses 275 RBs, and the UE needs to switch from BWP1to BWP2, it was assumed that the BWP1 bitfield is configured as001101101.

Zero-padding on the MSB of the bitfield for BWP2 results in0000000001101101, which is RIV=107. According to the mathematicaldefinition of RIV, this implies that L_(RBs) is 1 RB and RB_(start) isthe 107th RB. If the new mathematical definition for RIV is employed,this results in L_(RBs) being 107 RBs and RB_(start) being the 0th RB.

Zero-padding on the LSB of the bitfield for BWP2 results in0011011010000000, which is RIV=13952. According to the mathematicaldefinition of MV, this implies that L_(RBs) is 51 RBs and RB_(start) isthe 107th RB. If the new mathematical definition for RIV is employed,this results in L_(RBs) being 107 RBs and RR start being the 51st RB.

Example Embodiments for RA Based on RIV Sampling

Embodiments of the disclosed technology may sample (more specifically,downsample) a set of RIVs to generate an alternate set of RIVs that mayprevent resource blocking. In an example, and as shown in FIGS. 4A-4C,the smaller BWP RIV states are indexed from 0 to (M−1), and the largerBWP RIV states are indexed from 0 to (N−1).

In some embodiments, and as shown in FIG. 4A, the larger ceil(log2(N))-bit BWP bitfield (which indicates N states) may be sampled usingequal intervals. For example, a sampling interval of floor(N/M) may beused to select a subset of the states of the larger ceil(log 2(N))-bitBWP bitfield to determine the states of the smaller ceil(log 2(M))-bitbitfield.

In other embodiments, and as shown in FIG. 4B, the larger ceil(log2(N))-bit BWP bitfield may be sampled using equal intervals, and with anoffset from the first state of the larger BWP bitfield. For example, asampling interval of floor(N/M) may be used with an offset value toselect a subset of the states of the larger ceil(log 2(N))-bit BWPbitfield to determine the states of the smaller ceil(log 2(M))-bitbitfield.

In yet other embodiments, and as shown in FIG. 4C, the larger ceil(log2(N))-bit BWP bitfield may be sampled using unequal intervals. Forexample, a sampling interval of floor(N/M)+offsetY may be used to selecta subset of the states of the larger ceil(log 2(N))-bit BWP bitfield todetermine the states of the smaller ceil(log 2(M))-bit bitfield. FIG. 4Cshows that the sampling interval may continuously vary as the larger BWPbitfield is sampled. In an example, the offsets may be predetermined andread from a table or specification. In another example, the offsets maybe randomly generated. In yet another example, the offsets may be basedon a portion of the smaller ceil(log 2(M))-bit bitfield. In yet otherexamples, the offsets may be computed in real time.

Numerical Example. In an example, the bitfield of a large BWP (e.g. 200RBs which needs 15 bits) uses 2{circumflex over ( )}15 states, whereasthe bitfield of a smaller BWP (e.g. 50 RBs which needs 11 bits) only use2{circumflex over ( )}11 states. For this scenario, sampling representedby (1:2{circumflex over ( )}(15-11):2{circumflex over ( )}15) may beused, in either equal or unequal intervals, and with or without anoffset.

In some embodiments, the sampling may be from a larger ceil(log 2(N))set of RIV values to a smaller ceil(log 2(M)) set of RIV values as shownin FIGS. 4A-4C. For example, the states shown in FIGS. 4A-4C correspondto individual RIV values. In other embodiments, the sampling may be froma single bitfield as described in the numerical example above. Forexample, the states in FIGS. 4A-4C correspond to individual bits.

Example Embodiments for RA Based on RIV Monotonicity

Embodiments of the disclosed technology may modify the monotonicity ofthe definition in order eliminate resource blocking. The originaldefinition of the RIV for an LTE system, and as described in the contextof existing systems, the RIV value sorting order is to first keep theL_(RBs) constant while increasing RB_(start). However, this results in alack of monotonicity, as shown in FIG. 7.

For monotonicity, an increase in the RIV value should correspond toRB_(start) increasing when L_(RBs)=1, and the RIV value increasingshould correspond to RB_(start) increasing when L_(RBs)=2, and so forth.However, the restriction of L_(RBs)≥1 and this parameter not exceedingN_(BWP) ^(size)−RB_(start) results in RB_(start) not being able toiterate through all values when L_(RBs)>1. Thus, the RIV value does notalways indicate the combination of RB_(start) and L_(RBs) that areiterated through. As shown in Table 1, the bolded/highlighted entriescorrespond to MV values that do not correspond to the combination ofRB_(start) and L_(RBs) not changing monotonically.

TABLE 1 Example of a lack of monotonicity in RIV value generation RIV(RB_(start), L_(RBs)) RIV (RB_(start), L_(RBs)) RIV (RB_(start),L_(RBs)) 0 (0, 1) 2N + 1 (1, 3) 3N − 2 (1, N − 1) 1 (1, 1) . . . . 3N −1 (0, N − 1) . . . . . . . . 2 (2, 1) 3N − 3 (N − 3, 3) 3N (0, 4) 3(3, 1) 3N − 2 (1, N − 1) 3N + 1 (1, 4) . . . . 3N − 1 (0, N − 1) . . . .. . . . . . . . . . . . . . . . N − 1 (N − 1, 1) 3N (0, 4) 4N − 4 (N −4, 4) N (0, 2) 3N + 1 (1, 4) 4N − 3 (2, N − 2) N + 1 (1, 2) . . . . 4N −2 (1, N − 2) . . . . . . . . . . . . 4N − 4 (N − 4, 4) 4N − 1 (0, N − 2). . . . . . . . . . . . . . . . . . . . 2N − 2 (N − 2, 2) 4N − 3 (2, N −2) 4N (0, 5) 2N − 1 (0, N) 4N − 2 (1, N − 2) 4N + 1 (1, 5) 2N (0, 3) . .. . . . . . . . . . . . . . . . . . . . . . 2N + 1 (1, 3) 3N − 3 (N − 3,3) . . . . . . . . . . . .

In some embodiments, the monotonicity of the RIV may be corrected usingthe following formula given by:

If m==0

RIV _(new) =RIV

else

If (RIV>mN−1)&(RIV<(m+1)N−m)

RIV _(new) =RIV−m(m+1)/2

else

RIV _(new)=max(RIV)−((m−2N)(m+1)/2+RIV)

-   -   end

end

where max(RIV)=the max state of the MV, where m=[N/2], and where Nis thebandwidth of N_(BWP) ^(size).

Different embodiments of the disclosed technology, e.g. zero-paddingwith bit indication, new mathematical definitions, sampling andmonotonicity, may be combined to provide embodiments that preventresource blocking, and provide efficient resource allocation methodswhen configurable bandwidths are available.

FIG. 5 shows a flowchart for an exemplary method for resource allocationfor configurable bandwidths. The method 500 includes, at step 510,performing a first transmission using a first set of resources in afirst bandwidth.

The method 500 includes, at step 520, performing, subsequent to thefirst transmission, a second transmission using a second set ofresources in a second bandwidth. The first set of resources areidentified by a first value (or a first plurality of values) and thesecond set of resources are identified by a second value (or a secondplurality of values), and correspond to a UE switching from using thefirst set of resources for the first transmission to using the secondset of resources for the second transmission.

In some embodiments, and as described in the context of the “Embodimentsfor RA Based on RIV Zero-Padding with Bit Indication” section, the bitrepresentation of the first value is a zero-padded version of a bitrepresentation of the second value, with the bit representation of thesecond value being zero-padded on an MSB or an LSB.

In some embodiments, and as described in the context of the “Embodimentsfor RA Based on RIV Sampling” section, the first plurality of values maybe determined by selecting a subset of the second plurality of valuesbased on relative sizes of the first and second set of resources. Forexample, the sampling equal or unequal, and with or without an offset.

In some embodiments, and as described in the context of the “Embodimentsfor RA Based on RIV Monotonicity” section, the second value is based ona first value, and is computed using a monotonic function where thefirst value being greater than the second value, implies that (a) alength of the first set of resources is greater than or equal to alength of the second set of resource or (b) a starting index of thefirst set of resources is greater than or equal to a starting index ofthe second set of resources.

In some embodiments, and as described in the context of the “Embodimentsfor RA Based on New RIV Mathematical Definition” section, the firstvalue is of a first type that is generated by keeping a value of a firstvariable, e.g. L_(RBs), constant and increasing a value of a secondvariable, e.g. RB_(start), and the second value is of a second type thatis generated by keeping the value of the second variable constant andincreasing the value of the first variable.

FIG. 6 is a block diagram of an example apparatus that may implement amethod or technique described in this documents (e.g. methods 500). Aapparatus 605, such as a base station or a wireless device (or UE), caninclude processor electronics 610 such as a microprocessor thatimplements one or more of the techniques presented in this document. Theapparatus 605 can include transceiver electronics 615 to send and/orreceive wireless signals over one or more communication interfaces suchas antenna(s) 620. The apparatus 605 can include other communicationinterfaces for transmitting and receiving data. Apparatus 605 caninclude one or more memories (not explicitly shown) configured to storeinformation such as data and/or instructions. In some implementations,the processor electronics 610 can include at least a portion of thetransceiver electronics 615. In some embodiments, at least some of thedisclosed techniques, modules or functions are implemented using theapparatus 605.

It is intended that the specification, together with the drawings, beconsidered exemplary only, where exemplary means an example and, unlessotherwise stated, does not imply an ideal or a preferred embodiment. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. Additionally, the use of “or” is intended to include“and/or”, unless the context clearly indicates otherwise.

Some of the embodiments described herein are described in the generalcontext of methods or processes, which may be implemented in oneembodiment by a computer program product, embodied in acomputer-readable medium, including computer-executable instructions,such as program code, executed by computers in networked environments. Acomputer-readable medium may include removable and non-removable storagedevices including, but not limited to, Read Only Memory (ROM), RandomAccess Memory (RAM), compact discs (CDs), digital versatile discs (DVD),etc. Therefore, the computer-readable media can include a non-transitorystorage media. Generally, program modules may include routines,programs, objects, components, data structures, etc. that performparticular tasks or implement particular abstract data types. Computer-or processor-executable instructions, associated data structures, andprogram modules represent examples of program code for executing stepsof the methods disclosed herein. The particular sequence of suchexecutable instructions or associated data structures representsexamples of corresponding acts for implementing the functions describedin such steps or processes.

Some of the disclosed embodiments can be implemented as devices ormodules using hardware circuits, software, or combinations thereof. Forexample, a hardware circuit implementation can include discrete analogand/or digital components that are, for example, integrated as part of aprinted circuit board. Alternatively, or additionally, the disclosedcomponents or modules can be implemented as an Application SpecificIntegrated Circuit (ASIC) and/or as a Field Programmable Gate Array(FPGA) device. Some implementations may additionally or alternativelyinclude a digital signal processor (DSP) that is a specializedmicroprocessor with an architecture optimized for the operational needsof digital signal processing associated with the disclosedfunctionalities of this application. Similarly, the various componentsor sub-components within each module may be implemented in software,hardware or firmware. The connectivity between the modules and/orcomponents within the modules may be provided using any one of theconnectivity methods and media that is known in the art, including, butnot limited to, communications over the Internet, wired, or wirelessnetworks using the appropriate protocols.

While this document contains many specifics, these should not beconstrued as limitations on the scope of an invention that is claimed orof what may be claimed, but rather as descriptions of features specificto particular embodiments. Certain features that are described in thisdocument in the context of separate embodiments can also be implementedin combination in a single embodiment. Conversely, various features thatare described in the context of a single embodiment can also beimplemented in multiple embodiments separately or in any suitablesub-combination. Moreover, although features may be described above asacting in certain combinations and even initially claimed as such, oneor more features from a claimed combination can in some cases be excisedfrom the combination, and the claimed combination may be directed to asub-combination or a variation of a sub-combination. Similarly, whileoperations are depicted in the drawings in a particular order, thisshould not be understood as requiring that such operations be performedin the particular order shown or in sequential order, or that allillustrated operations be performed, to achieve desirable results.

Only a few implementations and examples are described and otherimplementations, enhancements and variations can be made based on whatis described and illustrated in this disclosure.

What is claimed is:
 1. A method for wireless communication, comprising:performing a first transmission using a first set of resources in afirst bandwidth; performing, subsequent to the first transmission, asecond transmission using a second set of resources in a secondbandwidth; and performing, subsequent to the second transmission, athird transmission using a third set of resources in the secondbandwidth; and wherein the second bandwidth is greater than the firstbandwidth, wherein the first set of resources is identified by a firstplurality of values, wherein the second set of resources is identifiedby a second plurality of values, wherein the third set of resources isidentified by a third plurality of values, and wherein the thirdplurality of values is determined by selecting a subset of the secondplurality of values based on relative sizes of the first and second setof resources.
 2. The method of claim 1, wherein the first, second andthird plurality of values correspond to a first, a second and a thirdplurality of resource indication values (RIVs), respectively, whereinthe first, second and third set of resources correspond to a firstnumber, a second number and a third number of resource blocks,respectively, and wherein the first and second bandwidths corresponds toa first and a second bandwidth part (BWP), respectively.
 3. The methodof claim 1, wherein the subset is selected uniformly from the secondplurality of values.
 4. The method of claim 1, wherein the subset isselected non-uniformly from the second plurality of values.
 5. Themethod of claim 1, wherein the selecting the subset of the secondplurality of values is further based on an offset value, wherein theoffset value is based on a bit representation of the first value,wherein the offset value is selected from a set ranging from 0 to (S−1),wherein S is a sampling interval, and wherein the sampling interval isbased a ratio of the sizes of the first and second set of resources. 6.A method for wireless communication, comprising: performing a firsttransmission using a first set of resources in a bandwidth; andperforming, subsequent to the first transmission, a second transmissionusing a second set of resources in the bandwidth, wherein the first setof resources is identified by a first plurality of values, wherein thesecond set of resources is identified by a second plurality of values,wherein the first plurality of values is based on the second pluralityof values, and wherein a third value of the second plurality of valuesis greater than a fourth value of the second plurality of values, and(a) a length corresponding to the third value is greater than or equalto a length corresponding to the fourth value or (b) a starting indexcorresponding to the third value is greater than or equal to a startingindex corresponding to the fourth value.
 7. The method of claim 6,wherein the first and second plurality of values correspond to a firstplurality and a second plurality of resource indication values (RIVs),respectively, wherein the first and second set of resources correspondto a first number and a second number of resource blocks, respectively,and wherein the bandwidth corresponds to a bandwidth part (BWP).
 8. Themethod of claim 7, wherein the determining the first plurality of values(RIV_(new)) is based onIf (m==0)RIV _(new) =RIVElseIf (RIV>(mN−1))&(RIV<(m+1)N−m)RIV _(new) =RIV−m(m+1)/2ElseRIV _(new)=max(RIV)−((m−2N)(m+1)/2+RIV) End End wherein max(RIV) is amaximum value of the first value, wherein N is the bandwidth, andwherein m=floor(N/2).
 9. A method for wireless communication,comprising: performing a first transmission using a first set ofresources in a bandwidth; and performing, subsequent to the firsttransmission, a second transmission using a second set of resources inthe bandwidth, wherein the first set of resources is identified by oneof a first plurality of values, wherein the second set of resources isidentified by one of a second plurality of values, wherein the firstplurality of values is determined by keeping a value of a first variableconstant and increasing a value of a second variable, and wherein thesecond plurality of values are determined by keeping the value of thesecond variable constant and increasing the value of the first variable.10. The method of claim 9, wherein the first and second plurality ofvalues correspond to a first plurality and a second plurality ofresource indication values (RIVs), respectively, wherein the first andsecond set of resources corresponds to a first number and a secondnumber of resource blocks, respectively, wherein the bandwidthcorresponds to a bandwidth part (BWP), wherein the first variablecorresponds to a length of the set of resources, and wherein the secondvariable corresponds to a starting index of the set of resources. 11.The method of claim 10, wherein the second plurality of values aredetermined using either a first equation or a second equation, whereinthe first equation is:If (RB _(start)≤floor(N/2))RIV=N×BR _(start)+(L _(RBs)−1)ElseRIV=N(N−RB _(start))+(N−L _(RBs))End,wherein ((N−RB _(start))≤L _(RBs)≤1), wherein the second equation is:If (RB _(start)≤floor(N/2))RIV _(temp) =N×RB _(start)+(L _(RBs)−1)ElseRIV _(temp) =N(N−RB _(start))+(N−L _(RBs))EndRIV=RIV _(max) −RIV _(temp),and wherein ((N−RB _(start))≤L _(RBs)≤1).
 12. An apparatus comprising aprocessor configured to: perform a first transmission using a first setof resources in a first bandwidth; perform, subsequent to the firsttransmission, a second transmission using a second set of resources in asecond bandwidth; and perform, subsequent to the second transmission, athird transmission using a third set of resources in the secondbandwidth; and wherein the second bandwidth is greater than the firstbandwidth, wherein the first set of resources is identified by a firstplurality of values, wherein the second set of resources is identifiedby a second plurality of values, wherein the third set of resources isidentified by a third plurality of values, and wherein the thirdplurality of values is determined by a selection of a subset of thesecond plurality of values based on relative sizes of the first andsecond set of resources.
 13. The apparatus of claim 12, wherein thefirst, second and third plurality of values correspond to a first, asecond and a third plurality of resource indication values (RIVs),respectively, wherein the first, second and third set of resourcescorrespond to a first number, a second number and a third number ofresource blocks, respectively, and wherein the first and secondbandwidths corresponds to a first and a second bandwidth part (BWP),respectively.
 14. The apparatus of claim 12, wherein the subset isselected uniformly from the second plurality of values.
 15. Theapparatus of claim 12, wherein the subset is selected non-uniformly fromthe second plurality of values.
 16. The apparatus of claim 12, whereinthe selection of the subset of the second plurality of values is furtherbased on an offset value, wherein the offset value is based on a bitrepresentation of the first value, wherein the offset value is selectedfrom a set ranging from 0 to (S−1), wherein S is a sampling interval,and wherein the sampling interval is based a ratio of the sizes of thefirst and second set of resources.
 17. An apparatus comprising aprocessor configured to: perform a first transmission using a first setof resources in a bandwidth; and perform, subsequent to the firsttransmission, a second transmission using a second set of resources inthe bandwidth, wherein the first set of resources is identified by afirst plurality of values, wherein the second set of resources isidentified by a second plurality of values, wherein the first pluralityof values is based on the second plurality of values, and wherein athird value of the second plurality of values is greater than a fourthvalue of the second plurality of values, and (a) a length correspondingto the third value is greater than or equal to a length corresponding tothe fourth value or (b) a starting index corresponding to the thirdvalue is greater than or equal to a starting index corresponding to thefourth value.
 18. The apparatus of claim 17, wherein the first andsecond plurality of values correspond to a first plurality and a secondplurality of resource indication values (RIVs), respectively, whereinthe first and second set of resources correspond to a first number and asecond number of resource blocks, respectively, and wherein thebandwidth corresponds to a bandwidth part (BWP).
 19. An apparatuscomprising a processor configured to: perform a first transmission usinga first set of resources in a bandwidth; and perform, subsequent to thefirst transmission, a second transmission using a second set ofresources in the bandwidth, wherein the first set of resources isidentified by one of a first plurality of values, wherein the second setof resources is identified by one of a second plurality of values,wherein the first plurality of values is determined by keeping a valueof a first variable constant and increasing a value of a secondvariable, and wherein the second plurality of values are determined bykeeping the value of the second variable constant and increasing thevalue of the first variable.
 20. The apparatus of claim 19, wherein thefirst and second plurality of values correspond to a first plurality anda second plurality of resource indication values (RIVs), respectively,wherein the first and second set of resources corresponds to a firstnumber and a second number of resource blocks, respectively, wherein thebandwidth corresponds to a bandwidth part (BWP), wherein the firstvariable corresponds to a length of the set of resources, and whereinthe second variable corresponds to a starting index of the set ofresources.